全文获取类型
收费全文 | 2990篇 |
免费 | 73篇 |
国内免费 | 1篇 |
出版年
2021年 | 37篇 |
2019年 | 88篇 |
2018年 | 55篇 |
2017年 | 82篇 |
2016年 | 84篇 |
2015年 | 62篇 |
2014年 | 66篇 |
2013年 | 740篇 |
2012年 | 25篇 |
2011年 | 25篇 |
2010年 | 35篇 |
2009年 | 37篇 |
2008年 | 48篇 |
2007年 | 53篇 |
2006年 | 36篇 |
2005年 | 43篇 |
2004年 | 56篇 |
2003年 | 43篇 |
2002年 | 58篇 |
2001年 | 33篇 |
2000年 | 32篇 |
1999年 | 42篇 |
1998年 | 47篇 |
1993年 | 25篇 |
1991年 | 34篇 |
1990年 | 25篇 |
1989年 | 32篇 |
1988年 | 23篇 |
1987年 | 23篇 |
1986年 | 70篇 |
1985年 | 64篇 |
1984年 | 37篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 45篇 |
1980年 | 51篇 |
1979年 | 47篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 46篇 |
1975年 | 47篇 |
1974年 | 53篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 41篇 |
1969年 | 40篇 |
1968年 | 35篇 |
1967年 | 33篇 |
1966年 | 27篇 |
排序方式: 共有3064条查询结果,搜索用时 16 毫秒
991.
This article examines a problem faced by a firm procuring a material input or good from a set of suppliers. The cost to procure the material from any given supplier is concave in the amount ordered from the supplier, up to a supplier‐specific capacity limit. This NP‐hard problem is further complicated by the observation that capacities are often uncertain in practice, due for instance to production shortages at the suppliers, or competition from other firms. We accommodate this uncertainty in a worst‐case (robust) fashion by modeling an adversarial entity (which we call the “follower”) with a limited procurement budget. The follower reduces supplier capacity to maximize the minimum cost required for our firm to procure its required goods. To guard against uncertainty, the firm can “protect” any supplier at a cost (e.g., by signing a contract with the supplier that guarantees supply availability, or investing in machine upgrades that guarantee the supplier's ability to produce goods at a desired level), ensuring that the anticipated capacity of that supplier will indeed be available. The problem we consider is thus a three‐stage game in which the firm first chooses which suppliers' capacities to protect, the follower acts next to reduce capacity from unprotected suppliers, and the firm then satisfies its demand using the remaining capacity. We formulate a three‐stage mixed‐integer program that is well‐suited to decomposition techniques and develop an effective cutting‐plane algorithm for its solution. The corresponding algorithmic approach solves a sequence of scaled and relaxed problem instances, which enables solving problems having much larger data values when compared to standard techniques. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
992.
Strengthening the United States' ability to prevent adversaries from smuggling nuclear materials into the country is a vital and ongoing issue. The prospect of additional countries, such as Iran, obtaining the know‐how and equipment to produce these special nuclear materials in the near future underscores the need for efficient and effective inspection policies at ports and border crossings. In addition, the reduction of defense and homeland security budgets in recent years has made it increasingly important to accomplish the interdiction mission with fewer funds. Addressing these complications, in this article, we present a novel two‐port interdiction model. We propose using prior inspection data as a low‐cost way of increasing overall interdiction performance. We provide insights into two primary questions: first, how should a decision maker at a domestic port use detection data from the foreign port to improve the overall detection capability? Second, what are potential limitations to the usefulness of prior inspection data—is it possible that using prior data actually harms decision making at the domestic port? We find that a boundary curve policy (BCP) that takes into account both foreign and domestic inspection data can provide a significant improvement in detection probability. This BCP also proves to be surprisingly robust, even if adversaries are able to infiltrate shipments during transit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 433‐448, 2013 相似文献
993.
In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013 相似文献
994.
In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013 相似文献
995.
Karen V. Fair 《Small Wars & Insurgencies》2013,24(1):107-126
Scholars disagree on the prevailing focus on insurgent ideology. Some claim that the dominant Marxist ideology of the Cold War era has been supplanted by a new focus on ethnic and national identity. Others claim that many insurgencies were always focused on identity, but the Cold War and superpower antipathies distorted perceptions of insurgencies as politically-economically focused. Yet the heart of the matter is that analysts are not faced with an ‘either/or’ proposition. 相似文献
996.
Brendan Simms Bruce Hoffman Daniel W. Fitz‐Simons Robert H. Dorff Jennifer Morrison Taw Gabriel Marcella 《Small Wars & Insurgencies》2013,24(1):127-139
Frank Zimmer, Bismarcks Kampf gegen Kaiser Franz Joseph Konigsgratz und seine Folgen. Graz, Vienna, Cologne: Styria Verlag 1996. Pp.203,49 illus., 1 map. OS 350/DM 49. ISBN 3–222–12377–2. Saul Zadka, Blood in Zion: How the Jewish Guerrillas drove the British out of Palestine. London and Washington: Brassey's, 1995. Pp.227, chron., illus., index. £19.95. ISBN 1–85753–136–1. Theodore L. Gatchel, At the Water's Edge: Defending against the Modern Amphibious Assault. Annapolis, MD: Naval Institute Press, 1996. Pp.xvi+217, notes, biblio, index. $36.95. ISBN 1–55750–308–7. Max G. Manwaring and William J. Olson (eds.) Managing Contemporary Conflict: Pillars of Success. Boulder, CO: Westview Press, 1996. Pp.269, no index. $65 (cloth); $25 (paper). ISBN 0–8133–8969 and 9978–5 Chris Seiple, The US Military/NGO Relationship in Humanitarian Interventions, Carlisle Barracks, PA: The Richard L. Millett and Michael Gold‐Biss (eds.) Beyond Praetorianism: The Latin American Military in Transition. University of Miami: North/South Center Press; Boulder, CO: Lynne Rienner, 1996. Pp.xv +317, index. $24.95. ISBN 1–5745–000–9. Rudolph C. Barnes Jr, Military Legitimacy: Might and Right in the New Millennium. London and Portland, OR: Frank Cass, 1996. Pp.199, select biblio., index. £27.50/$39.50, ISBN 0–714–4624–5. 相似文献
997.
998.
999.
Thomas R. Mockaitis 《Small Wars & Insurgencies》2013,24(1):132-133
Steven L. Burg and Paul S. Shoup, The War in Bosnia‐Herzegovina: Ethnic Conflict and International Intervention.New York: M.E. Sharpe, 1999. Pp.xviii + 499, maps, tables, notes, biobliog., index. NP. ISBN 1–56324–308–3. 相似文献
1000.
The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献